Generation of Musical Sequences with Genetic Techniques

نویسندگان

  • Anthony Richard Burton
  • Tanya Vladimirova
چکیده

Biologically inspired computational methods have recently attracted much research interest in the field of computer music. This group of methods is a subset of computational intelligence, and is represented by neural networks (NNs), genetic algorithms (GAs), and genetic programming (GP). A common feature of these methods is that they all mimic biological processes: NNs realize the evolutionary device of learning from experience, as humans and other animals do, while GAs and GP are based upon procedures that imitate the laws of natural selection. Genetic algorithms have been shown to display distinct performance improvements compared to enumerative, calculus-based, and random searches of a given arbitrary search space (Goldberg 1989). This is achieved by combining aspects of these search methods to result in a " guided random " search. The genetic algorithm samples points throughout the search space for their worth, and is " blind " to any information regarding the search space apart from this measure of worth. This makes genetic search techniques more general and applicable to many search or optimization tasks, as long as an appropriate encoding scheme is employed. By using a population of candidate solutions, rather than single individuals, an inherent parallel-ism in the search process is apparent. This is because the search for an optimum solution is " performed over genetic structures (building blocks) that can represent a number of possible solutions " (Filho, Treleaven, and Alippi 1994). Genetic programming techniques expand on the versatility of GA techniques by evolving generations of functions, rather than representations of a single function. This is based upon the need to evolve computer programs to solve a problem, rather than evolving solutions to a given fixed problem (Koza 1992). Computational intelligence techniques have been applied to musical problems across a wide range of subject areas, including algorithmic composition , artificial listening, musical cognition, and sound synthesis (Todd and Loy 1991; Balaban, Ebcioglu, and Laske 1992), while GAs have been applied principally to the musical tasks of composition and synthesis. The search space for both of these tasks is potentially vast, considering the number of possible musical compositions and musical sounds. The use of stylistic or timbral constraints upon a composition or synthesis task reduces the size of the search space, yet the space still remains inefficiently large for traditional search techniques. Genetic techniques are able to perform well with large search spaces, owing to their inherent parallelism. The aim of …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sampling Variations of Sequences for Structured Music Generation

Recently, machine-learning techniques have been successfully used for the generation of complex artifacts such as music or text. However, these techniques are still unable to capture and generate artifacts that are convincingly structured. In particular, musical sequences do not exhibit pattern structure, as typically found in human composed music. We present an approach to generate structured ...

متن کامل

Sampling Variations of Lead Sheets

Machine-learning techniques have been recently used with spectacular results to generate artefacts such as music or text. However, these techniques are still unable to capture and generate artefacts that are convincingly structured. In this paper we present an approach to generate structured musical sequences. We introduce a mechanism for sampling efficiently variations of musical sequences. Gi...

متن کامل

Music Generation through Cellular Automata: How to Give Life to Strange Creatures

Cellular Automata (CA), like every other dynamical system, can be used to generate music. Starting from any initial state and applying to CA simple transition rules, such models are able to produce numerical sequences that can be successively associated to physical parameters. This approach is interesting because, maintaining fixed the set of rules and varying the initial data, many different, ...

متن کامل

GP-Music: An Interactive Genetic Programming System for Music Generation with Automated Fitness Raters

In this paper we present the GP-Music System, an interactive system which allows users to evolve short musical sequences using interactive genetic programming, and its extensions aimed at making the system fully automated. The basic GPsystem works by using a genetic programming algorithm, a small set of functions for creating musical sequences, and a user interface which allows the user to rate...

متن کامل

Parallel Generation of t-ary Trees

A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computer Music Journal

دوره 23  شماره 

صفحات  -

تاریخ انتشار 1999